منابع مشابه
Bracketing Numbers of Convex Functions on Polytopes
We study bracketing numbers for spaces of bounded convex functions in the Lp norms. We impose no Lipschitz constraint. Previous results gave bounds when the domain of the functions is a hyperrectangle. We extend these results to the case wherein the domain is a polytope. Bracketing numbers are crucial quantities for understanding asymptotic behavior for many statistical nonparametric estimators...
متن کاملSmooth Functions and Smooth Maps
The main reason for introducing smooth structures was to enable us to define smooth functions on manifolds and smooth maps between manifolds. In this chapter we carry out that project. We begin by defining smooth real-valued and vector-valued functions, and then generalize this to smooth maps between manifolds. We then focus our attention for a while on the special case of diffeomorphisms, whic...
متن کاملHow Many Distribution Functions Are There? Bracketing Entropy Bounds for High Dimensional Distribution Functions
This means that every F ∈ Fd satisfies: (i) (non-negativity). For finite intervals I = (a1, b1] × · · · × (ad, bd] ≡ (a, b], with a, b ∈ Rd, F (I) = ∆dF (a, b] ≥ 0 where ∆d denotes the d−dimensional difference operator. (ii) (continuity from above). If y ↓ x, then F (y) ↓ F (x). (iii) (normalization). If x1∧. . .∧xd → −∞, then F (x) → 0; if x1∧. . .∧xd → +∞, then F (x) → 1. (See Billingsley [4]...
متن کاملSmooth minimization of non-smooth functions
In this paper we propose a new approach for constructing efficient schemes for non-smooth convex optimization. It is based on a special smoothing technique, which can be applied to functions with explicit max-structure. Our approach can be considered as an alternative to black-box minimization. From the viewpoint of efficiency estimates, we manage to improve the traditional bounds on the number...
متن کاملApproximating Piecewise-Smooth Functions
We consider the possibility of using locally supported quasi-interpolation operators for the approximation of univariate non-smooth functions. In such a case one usually expects the rate of approximation to be lower than that of smooth functions. It is shown in this paper that prior knowledge of the type of ’singularity’ of the function can be used to regain the full approximation power of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 1994
ISSN: 0304-4149
DOI: 10.1016/0304-4149(94)90102-3